Texture Mapping by Succesive Refinement
نویسندگان
چکیده
We define texture mapping as an optimization problem for which the goal is to preserve the maximum amount of information in the mapped texture. We derive a solution that is optimal in the least-squares sense and that corresponds to the pseudo-inverse of the texturemapping transformation. In practice, a first-order approximation of the least-squares solution is used as an initial estimate for the mapped texture. This initial solution is refined by successive approximation to yield the least-squares optimal result. In essence, the proposed multi-pass method acts like an adaptive antialiasing filter. keywords: texture mapping, least-squares approximation, successive refinement, anti-aliasing
منابع مشابه
A novel constrained texture mapping method based on harmonic map
In this paper, we present a novel constrained texture mapping method based on the harmonic map. We first project the surface of a 3D model on a planar domain by an angle-based-flattening technique and perform a parametrization. The user then specifies interactively the constraints between the selected feature points on the parametric domain of the 3D model and the corresponding pixels on the te...
متن کاملWeb Image Retrieval Refinement by Visual Contents
For Web image retrieval, two basic methods can be used for representing and indexing Web images. One is based on the associate text around the Web images; and the other utilizes visual features of images, such as color, texture, shape, as the descriptions of Web images. However, those two methods are often applied independently in practice. In fact, both have their limitations to support Web im...
متن کاملOn the Refinement of Urban Models by Terrestrial Data Collection
Urban models can be collected area covering and efficiently based on aerial data like stereo images or LIDAR. While a large number of applications like simulations are already feasible based on the available three-dimensional building representations, a further quality improvement is required for some other tasks. Especially, if very realistic visualisations from pedestrian viewpoints have to b...
متن کاملProgressive compression of arbitrary textured meshes
In this paper, we present a progressive compression algorithm for textured surface meshes, which is able to handle polygonal non-manifold meshes as well as discontinuities in the texture mapping. Our method applies iterative batched simplifications, which create high quality levels of detail by preserving both the geometry and the texture mapping. The main features of our algorithm are (1) gene...
متن کاملSimultaneously Reconstructing Transparent and Opaque Surfaces from Texture Images
This paper addresses the problem of reconstructing nonoverlapping transparent and opaque surfaces from multiple view images. The reconstruction is attained through progressive refinement of an initial 3D shape by minimizing the error between the images of the object and the initial 3D shape. The challenge is to simultaneously reconstruct both the transparent and opaque surfaces given only a lim...
متن کامل